A Theoretical Framework for Optimality Conditions of Nonlinear Type-2 Interval-Valued Unconstrained and Constrained Optimization Problems Using Type-2 Interval Order Relations
نویسندگان
چکیده
In the traditional nonlinear optimization theory, Karush-Kuhn-Tucker (KKT) optimality conditions for constrained problems with inequality constraints play an essential role. The situation becomes challenging when theory of is discussed under uncertainty. Several researchers have interval approach to tackle uncertainty and derived conditions. However, there are several realistic situations in which not suitable. This study aims introduce Type-2 overcome limitation classical approach. introduces order relation interval-valued function concepts derive generalized KKT uncertain environments. Then, unconstrained problem after that, using these conditions, derived. Finally, proposed demonstrated by numerical examples.
منابع مشابه
Interval Type-2 Fuzzy Rough Sets and Interval Type-2 Fuzzy Closure Spaces
The purpose of the present work is to establish a one-to-one correspondence between the family of interval type-2 fuzzy reflexive/tolerance approximation spaces and the family of interval type-2 fuzzy closure spaces.
متن کاملEmbedded Interval Valued Type-2 Fuzzy Sets
Type-2 fuzzy sets are growing in popularity as, for certain applications they model uncertainty and imprecision better than type1 fuzzy sets. However, type-2 fuzzy sets can be difficult to understand and explain. Recent work has introduced embedded type-2 fuzzy sets and the Representation Theorem which enable us to discuss type-2 fuzzy sets in a different way. In particular they allow for alter...
متن کاملinterval type-2 fuzzy rough sets and interval type-2 fuzzy closure spaces
the purpose of the present work is to establish a one-to-one correspondence between the family of interval type-2 fuzzy reflexive/tolerance approximation spaces and the family of interval type-2 fuzzy closure spaces.
متن کاملInterval Analysis: Unconstrained and Constrained Optimization
INTERVAL ANALYSIS: UNCON-STRAINED AND CONSTRAINED OPTIMIZATION Introduction. Interval algorithms for constrained and un-constrained optimization are based on adaptive, exhaustive search of the domain. Their overall structure is virtually identical to Lipschitz optimization as in [4], since interval evaluations of an objective function φ over an interval vector x correspond to estimation of the ...
متن کاملA note on optimality conditions to interval optimization problems
In this article we examine to necessary and sufficient optimality conditions for interval optimization problems. We introduce a new concept of stationary point for an interval-valued function based on the gH-derivative. We show the importance the this concept from a practical and computational point of view. We introduce a new concept of invexity for gH-differentiable interval-valued function w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2021
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math9080908